testcases = int(input())
numbers = []
for i in range(testcases):
n = int(input())
numbers.append(list(map(int,input().split())))
def checkSequence(num):
l = 0
r = len(num) - 1
redCount = 0
redSum = 0
blueCount = 0
blueSum = 0
while l <= r:
if redCount < blueCount and redSum > blueSum:
return 'YES'
if redSum <= blueSum:
redSum += num[r]
redCount += 1
r -= 1
elif blueCount <= redCount:
blueSum += num[l]
blueCount += 1
l += 1
if redCount < blueCount and redSum > blueSum:
return 'YES'
return 'NO'
for num in numbers:
num.sort()
print(checkSequence(num))
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long t,n;
cin>>t;
while(t--){
cin>>n;
long long arr[n];
for(long long i=0;i<n;i++){
cin>>arr[i];
}
sort(arr,arr+n);
// reverse(arr,arr+n);
if(n%2==0){
long long l=(n/2-1);
long long sum=arr[0]; long long cnt = 0;
int c=0;
for(int i=0;i<(l);i++){
sum=sum+arr[i+1];
cnt=cnt+arr[(n-1)-i];
// cout<<cnt<<" "<<sum<<endl;
if(cnt>sum){
cout<<"YES"<<endl;
c=1;
break;
}
}
if(c==0){
cout<<"NO"<<endl;
}
}else
{
long long l=(n/2);
long long sum=arr[0]; long long cnt = 0;
int c=0;
for(int i=0;i<(l);i++){
sum=sum+arr[i+1];
cnt=cnt+arr[(n-1)-i];
// cout<<cnt<<" "<<sum<<endl;
if(cnt>sum){
cout<<"YES"<<endl;
c=1;
break;
}
}
if(c==0){
cout<<"NO"<<endl;
}
}
}
return 0;
}
WLDRPL Wildcard Replacement | 1221. Split a String in Balanced Strings |
1002. Find Common Characters | 1602A - Two Subsequences |
1555A - PizzaForces | 1607B - Odd Grasshopper |
1084A - The Fair Nut and Elevator | 1440B - Sum of Medians |
1032A - Kitchen Utensils | 1501B - Napoleon Cake |
1584B - Coloring Rectangles | 1562B - Scenes From a Memory |
1521A - Nastia and Nearly Good Numbers | 208. Implement Trie |
1605B - Reverse Sort | 1607C - Minimum Extraction |
1604B - XOR Specia-LIS-t | 1606B - Update Files |
1598B - Groups | 1602B - Divine Array |
1594B - Special Numbers | 1614A - Divan and a Store |
2085. Count Common Words With One Occurrence | 2089. Find Target Indices After Sorting Array |
2090. K Radius Subarray Averages | 2091. Removing Minimum and Maximum From Array |
6. Zigzag Conversion | 1612B - Special Permutation |
1481. Least Number of Unique Integers after K Removals | 1035. Uncrossed Lines |